Image dependent log-likelihood ratio allocation for repeat accumulate code-based decoding in data hiding channels
نویسندگان
چکیده
Error correction codes of suitable redundancy are used for ensuring perfect data recovery in noisy channels. For iterative decoding based methods, the decoder needs to be initialized with proper confidence values, called the log likelihood ratios (LLRs), for all the embedding locations. If these confidence values or LLRs are accurately initialized, the decoder converges at a lower redundancy factor, thus leading to a higher effective hiding rate. Here, we present an LLR allocation method based on the image statistics, the hiding parameters and the noisy channel characteristics. It is seen that this image-dependent LLR allocation scheme results in a higher data-rate, than using a constant LLR across all images. The data-hiding channel parameters are learned from the image histogram in the discrete cosine transform (DCT) domain using a linear regression framework. We also show how the effective data-rate can be increased by suitably increasing the erasure rate at the decoder.
منابع مشابه
Capacity-Achieving Codes for Noisy Channels with Bounded Graphical Complexity and Maximum Likelihood Decoding
In this paper, capacity-achieving codes for memoryless binary-input output-symmetric (MBIOS) channels under maximum-likelihood (ML) decoding with bounded graphical complexity are investigated. The graphical complexity of a code is defined as the number of edges in the graphical representation of the code per information bit and is proportional to the decoding complexity per information bit per ...
متن کاملGraph-based Codes and Iterative Decoding
The field of error correcting codes was revolutionized by the introduction of turbo codes [7] in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity. Since then, much progress has been made towards understanding the performance of these codes, as well as in using this understanding to design even better codes. Thi...
متن کاملRobust Image Transmission with Rate- Compatible Low-Density Parity-Check codes over Noisy Channels
Rate-Compatible Low-Density Parity-Check (RC-LDPC) codes are proposed to provide unequal error protection (UEP) for robust and efficient transmission of progressively compressed images over noisy channels. The total bit budget is partitioned between the source and channel coding, and the optimal rates are assigned to source encoded packets with a trellis-based rate-allocation algorithm using a ...
متن کاملA Turbo-Like Iterative Decoding Algorithm for Network Coded HARQ
This paper proposes a turbo-like decoding algorithm for network coded HARQ (NC-HARQ) retransmission scheme. Instead of retransmission erroneous packets individually, we send a network coded packet formed by XOR of two incorrectly received packets in the NC-HARQ retransmission. With respect to the two initial packets and one network coded packet, this retransmission scheme can be viewed as a pro...
متن کاملLeast reliable messages based early termination method for LT soft decoder
In this paper, we propose a new early termination method (ETM) for Luby transform (LT) belief propagation (BP) decoder. The proposed ETM, which we call least reliable messages (LRM), observes only sign alterations of a small cluster in log-likelihood ratio (LLR) messages passing between nodes in BP decoder. Simulation results and complexity analyzes show that LRM significantly lower computation...
متن کامل